Flipping Modules to Improve Circuit Performance and Routability
نویسندگان
چکیده
Preplaced modules may be flipped to improve performance and/or routability. We show that several versions of the module flipping problem are NP-hard. We propose algorithms to obtain module orientations that minimize the total wire length for module matrix and standard cell models. Additionally, we propose a heuristic to flip modules so as to minimize the length of the longest signal path. The results of experiments performed with this heuristic are also presented.
منابع مشابه
NP-Hard Module Rotation Problems
Preplaced circuit modules may be rotated to improve performance and/or routability. We show that several simple versions of the module rotation problem are NP-hard.
متن کاملDesign and analysis of FPGA/FPIC switch modules
Yao-Wen Chang1, D. F. Wong1, and C. K. Wong2y 1Department of Computer Sciences, University of Texas at Austin, Austin, Texas 78712 2Department of Computer Science, Chinese University of Hong Kong, Hong Kong Abstract Switch modules are the most important component of the routing resources in FPGA's and FPIC's. The quality of switch modules greatly a ects FPGA/FPIC routing solutions. The switch-m...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملFast and Incremental Routability Check of A Topological Routing Using a Cut-based Encoding
abstract Many performance-driven routing algorithms do not consider routability. Routing trees are built assuming that there are no other wires. The main reason for this is that it is NP-hard to guarantee routability. Even checking for routabil-ity is a time-consuming process. This limits the usefulness of many performance-driven routing algorithms because unroutable designs are useless. Previo...
متن کامل